On Milliken-Taylor Ultrafilters

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Milliken-Taylor Ultrafilters

We show that there may be a Milliken-Taylor ultrafilter with infinitely many near coherence classes of ultrafilters in its projection to ω, answering a question by López-Abad. We show that k-coloured Milliken-Taylor ultrafilters have at least k + 1 near coherence classes of ultrafilters in its projection to ω. We show that the Mathias forcing with a Milliken-Taylor ultrafilter destroys all Mill...

متن کامل

Polynomial Extensions of the Milliken-taylor Theorem

Milliken-Taylor systems are some of the most general infinitary configurations that are known to be partition regular. These are sets of the form MT (〈ai〉i=1, 〈xn〉n=1) = { ∑m i=1 ai ∑ t∈Fi xt : F1, F2, . . . , Fm are increasing finite nonempty subsets of N}, where a1, a2, . . . , am ∈ Z with am > 0 and 〈xn〉n=1 is a sequence in N. That is, if p(y1, y2, . . . , ym) = ∑m i=1 aiyi is a given linear...

متن کامل

ON SOFT ULTRAFILTERS

In this paper, the concept of soft ultrafilters is introduced and some of the related structures such as soft Stone-Cech compactification, principal soft ultrafilters and basis for its topology are studied.

متن کامل

Nonregular ultrafilters on ω2

We obtain lower bounds for the consistency strength of fully nonregular ultrafilters on ω2.

متن کامل

Ultrafilters on G-spaces

For a discrete group G and a discrete G-space X, we identify the Stone-Čech compactifications βG and βX with the sets of all ultrafilters on G and X, and apply the natural action of βG on βX to characterize large, thick, thin, sparse and scattered subsets of X. We use G-invariant partitions and colorings to define G-selective and G-Ramsey ultrafilters on X. We show that, in contrast to the set-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 2011

ISSN: 0029-4527

DOI: 10.1215/00294527-1499345